Practical approximate indoor nearest neighbour locating with crowdsourced RSSIs

نویسندگان

چکیده

In the indoor space, finding nearest neighbour is of great importance in location-based services. Received Signal Strength Indication (RSSI) has received much attention due to its simplicity and compatibility with existing hardware, which been widely used for localization. Existing search methods are based on real walking distance, need ground survey labor work measure many distances. Crowdsourcing a low-cost efficient way collect RSSI space without expert surveyors designated coordinates collection points. The crowdsourced RSSIs can reflect location objects RSSI-based localization method simplistic as it needs low hardware requirements, deployment cost no distance. So we study how RSSIs. To address this problem, propose graph interval weights, called I-graph, connect represent topology space. We also construct tree index D-tree, weights efficiently. novel distance metric relationship between locate RSSIs, devise algorithms pruning strategies computing query. demonstrate efficiency effectiveness proposed solution through extensive experiments two data sets.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate Nearest-Neighbour Search with Inverted Signature Slice Lists

In this paper we present an original approach for finding approximate nearest neighbours in collections of locality-sensitive hashes. The paper demonstrates that this approach makes high-performance nearest-neighbour searching feasible on Web-scale collections and commodity hardware with minimal degradation in search quality.

متن کامل

Fractal Approximate Nearest Neighbour Search in Log-Log Time

Nearest neighbour searches in the image plane are among the most frequent problems in a variety of computer vision and image processing tasks. They can be used to replace missing values in image filtering, or to group close objects in image segmentation, or to access neighbouring points of interest in feature extraction. In particular, we address two nearest neighbour problems: The nearest neig...

متن کامل

Realtime Registration-Based Tracking via Approximate Nearest Neighbour Search

We introduce a new 2D visual tracking algorithm that utilizes an approximate nearest neighbour search to estimate per-frame state updates. We experimentally demonstrate that the new algorithm capable of estimating larger per-frame motions than the standard registration-based algorithms and that it is more robust in a vision-controlled robotic alignment task.

متن کامل

TERZIĆ: SHAPE DETECTION WITH NEAREST NEIGHBOUR CONTOUR FRAGMENTS 1 Shape Detection with Nearest Neighbour Contour Fragments

We present a novel method for shape detection in natural scenes based on incomplete contour fragments and nearest neighbour search. In contrast to popular methods which employ sliding windows, chamfer matching and SVMs, we characterise each contour fragment by a local descriptor and perform a fast nearest-neighbour search to find similar fragments in the training set. Based on this idea, we sho...

متن کامل

k-Nearest Neighbour Classifiers

Perhaps the most straightforward classifier in the arsenal or machine learning techniques is the Nearest Neighbour Classifier – classification is achieved by identifying the nearest neighbours to a query example and using those neighbours to determine the class of the query. This approach to classification is of particular importance today because issues of poor run-time performance is not such...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: World Wide Web

سال: 2021

ISSN: ['1573-1413', '1386-145X']

DOI: https://doi.org/10.1007/s11280-021-00868-5